Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
201	Flat covers: The direct method Wolfgang Rump 1. An additive Ramsey theorem Let K be an infinite complete graph with red and green edges. Ramsey’s theorem states that there Add to Reading List Source URL: www.iaz.uni-stuttgart.de Language: English - Date: 2011-04-18 04:45:00
202	260 Genome Informatics 16(2): 260–Interaction Graph Mining for Protein Complexes Using Local Clique Merging Add to Reading List Source URL: www.jsbi.org Language: English - Date: 2005-12-28 06:18:58 Clique NP-complete problems Neighbourhood Networks Clique problem Clique percolation method
203	DRAFT On Paths in a Complete Bipartite Geometric Graph Atsushi Kaneko1 and M.Kano2 1 Add to Reading List Source URL: gorogoro.cis.ibaraki.ac.jp Language: English - Date: 2006-01-08 02:49:22
204	Obstructions for three-coloring graphs without induced paths on six vertices Maria Chudnovsky∗1 , Jan Goedgebeur†2 , Oliver Schaudt3 , and Mingxian Zhong4 1 Princeton University, Princeton, NJ 08544, USA. E-mail: mc Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2015-09-19 08:52:09 Graph theory Graph coloring NP-complete problems Line graph Matching Neighbourhood Chordal graph Graph Block graph Covering graph
205	Graph Matching with Anchor Nodes: A Learning Approach Nan Hu Raif M. Rustamov Leonidas Guibas Stanford University Add to Reading List Source URL: geometry.stanford.edu Language: English - Date: 2013-07-22 03:52:47 Combinatorial optimization Graph theory Matching Graph Hypergraph Graph operations NP-complete problems Bipartite double cover Line graph
206	Systematic Identification of Weak Connections between Clusters in Biological Network Hiroki Sakai 1 Add to Reading List Source URL: www.jsbi.org Language: English - Date: 2005-01-18 00:59:57 Graph theory Mathematics Discrete mathematics Clique Vertex Networks Graph NP-complete problems Network theory Community structure
207	The union-closed sets conjecture almost holds for almost all random bipartite graphs Henning Bruhn and Oliver Schaudt Abstract Frankl’s union-closed sets conjecture states that in every finite unionclosed family of set Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2013-05-11 13:53:39 Graph theory Mathematics Graph coloring Combinatorial optimization Matching NP-complete problems Bipartite graph Union-closed sets conjecture Maximal independent set Triangle-free graph
208	Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles Oliver Schaudt Institut f¨ ur Informatik, Universit¨at zu K¨oln, K¨oln, Germany Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-10-02 11:19:31 NP-complete problems Graph Graph theory Matching Cycle Hamiltonian path Spanning tree
209	Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages Maciej Besta Torsten Hoefler Add to Reading List Source URL: htor.inf.ethz.ch Language: English - Date: 2015-09-14 07:27:20 Graph theory Mathematics Computing Concurrency control Transaction processing NP-complete problems Computer memory Transactional memory Vertex Breadth-first search Graph coloring Transactional Synchronization Extensions
210	Local Properties of Geometric Graphs Jean Cardinal∗ S´ebastien Collette† Stefan Langerman‡ § relation between any pair of sites and the number of items in its neighborhood. Add to Reading List Source URL: www.ulb.ac.be Language: English - Date: 2011-02-08 09:21:41 Graph theory Bipartite graphs Geometric spanner Shortest path problem Planar graph Tree Delaunay triangulation NP-complete problems Planar separator theorem Trapezoid graph

UPDATE